Infinitely generated semigroups and polynomial complexity
نویسنده
چکیده
This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM 2 of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We construct a machine model for the functions in RM 2 , and evaluation functions. We prove that RM 2 is not finitely generated, and use this to show separation results for time-complexity.
منابع مشابه
The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices
W e present a deterministic polynomial-time algorithm for the ABC problem, which is the membership problem for 2-generated commutative linear semigroups over an algebraic number field. W e also obtain a polynomial t ime algorithm for the (easier) membership problem for 2-generated abelian linear groups. Furthermore, we provide a polynomial-sized encoding for the set of all solutions.
متن کاملThe word problem for free adequate semigroups
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and compute normal forms in each of these, and hence also to test whether any given identity holds in the classes of left, right and/or two-sided adequate semigroups.
متن کاملDynamics of postcritically bounded polynomial semigroups III: classification of semi-hyperbolic semigroups and random Julia sets which are Jordan curves but not quasicircles
We investigate the dynamics of polynomial semigroups (semigroups generated by a family of polynomial maps on the Riemann sphere Ĉ) and the random dynamics of polynomials on the Riemann sphere. Combining the dynamics of semigroups and the fiberwise (random) dynamics, we give a classification of polynomial semigroups G such that G is generated by a compact family Γ, the planar postcritical set of...
متن کاملGrowth of Rees Quotients of Free inverse Semigroups Defined by Small numbers of Relators
We study the asymptotic behaviour of a finitely presented Rees quotient S = Inv〈A | ci = 0 (i = 1, . . . , k) 〉 of a free inverse semigroup over a finite alphabet A. It is shown that if the semigroup S has polynomial growth then S is monogenic (with zero) or k ≥ 3. The three relator case is fully characterised, yielding a sequence of two-generated three-relator semigroups whose Gelfand-Kirillov...
متن کاملOn Polynomial Ideals, Their Complexity, and Applications
A polynomial ideal membership problem is a (w+1)-tuple P = (f; g 1 ; g 2 ; : : : ; g w) where f and the g i are multivariate polynomials over some ring, and the problem is to determine whether f is in the ideal generated by the g i. For polynomials over the integers or rationals, it is known that this problem is exponential space complete. We discuss complexity results known for a number of pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 26 شماره
صفحات -
تاریخ انتشار 2016